Maxima of the Q-index of non-bipartite C3-free graphs

نویسندگان

چکیده

A classic result in extremal graph theory, known as Mantel's theorem, states that every non-bipartite of order n with size m>⌊n24⌋ contains a triangle. Lin, Ning and Wu [Comb. Probab. Comput. 30 (2021) 258-270] proved spectral version theorem for given n. Zhai Shu [Discrete Math. 345 (2022) 112630] investigated fixed m. In this paper, we prove Q-spectral versions theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maxima of the Q-index: degenerate graphs

Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the join of a complete graph of order k and an independent set of order n−k. In this note, it is shown that Sn,k is extremal for some spectral parameters of G as well. More precisely, letting μ (H) and q (H) denote the largest eigenvalues of the adjacency matrix and the signless Laplacian of a graph H...

متن کامل

Ela Maxima of the Q-index: Graphs without Long Paths

This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n− k, and let S n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k, and let G be a graph of order n...

متن کامل

Maxima of the Q-index: graphs without long paths

This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n− k, and let S n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k, and let G be a graph of order n...

متن کامل

Ela Maxima of the Q-index: Degenerate Graphs

Abstract. Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the join of a complete graph of order k and an independent set of order n−k. In this note, it is shown that Sn,k is extremal for some spectral parameters of G as well. More precisely, letting μ (H) and q (H) denote the largest eigenvalues of the adjacency matrix and the signless Laplacian of...

متن کامل

commuting and non -commuting graphs of finit groups

فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2023

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2023.05.008